#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 15;
const double eps = 1e-8;
int n, m;
double a[N][N];

int getmx(int i) {
  int mx = i;
  rep(j, i, n) if (abs(a[j][i]) > abs(a[mx][i])) mx = j;
  return mx;
}
bool gauss() {
  rep(i, 1, n) {
    int idx = getmx(i);
    if (abs(a[idx][i]) < eps) return false;
    if (idx != i) rep(j, 1, n + 1) swap(a[i][j], a[idx][j]);
    double x = a[i][i];
    rep(j, i, n + 1) a[i][j] /= x;
    rep(j, 1, n) {
      if (j == i) continue;
      x = a[j][i];
      rep(k, i, n + 1) a[j][k] -= x * a[i][k];
    }
  }
  return true;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  rep(i, 1, n + 1) rep(j, 1, n) cin >> a[i][j];
  rep(i, 1, n) {
    double sum = 0;
    rep(j, 1, n) {
      sum += a[i][j] * a[i][j] - a[n + 1][j] * a[n + 1][j];
      a[i][j] = 2 * (a[i][j] - a[n + 1][j]);
    }
    a[i][n + 1] = sum;
  }
  gauss();
  rep(i, 1, n) cout << fixed << setprecision(3) << a[i][n + 1] << ' ';
  return 0;
}